Random Graphs from a Weighted Minor-Closed Class
نویسندگان
چکیده
منابع مشابه
Random Graphs from a Weighted Minor-Closed Class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a more general model. We consider random graphs from a ‘well-behaved’ class of graphs: examples of such classes include all minor-closed classes of graphs with ...
متن کاملConnectivity for Random Graphs from a Weighted Bridge-Addable Class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general bridge-addable class A of graphs – if a graph is in A and u and v are vertices in different components then the graph obtained by adding an edge (bridge) between u and v must also be in A. Various bound...
متن کاملRandom walks pertaining to a class of deterministic weighted graphs
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
متن کاملRandom Graphs from a Block Class
A block class is a class of graphs such that a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most random n-vertex graphs in such a class, each vertex is in at most (1+o(1)) log n/ log logn blocks, and each path passes through at most 5(n log n) blocks. Further, these results remain true when we condition on the numbers of components and blocks, and ...
متن کاملRandom graphs from a block-stable class
A class of graphs is called block-stable when a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most n-vertex graphs in such a class, each vertex is in at most (1+o(1)) log n/ log log n blocks, and each path passes through at most 5(n log n) blocks. These results extend to ‘weakly blockstable’ classes of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2793